EFFICIENTLY SEARCHING NEAREST NEIGHBOR IN DOCUMENTS USING KEYWORDS
نویسندگان
چکیده
منابع مشابه
Non-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملSearching of Nearest Neighbor Based on Keywords using Spatial Inverted Index
Many search engines are used to search anything from anywhere; this system is used to fast nearest neighbor search using keyword. Existing works mainly focus on finding top-k Nearest Neighbors, where each node has to match the whole querying keywords .It does not consider the density of data objects in the spatial space. Also these methods are low efficient for incremental query. But in intende...
متن کاملClustering-based Nearest Neighbor Searching
This paper proposes a Clustering-based Nearest Neighbor Search algorithm (CNNS) for high dimensional data. Different from existing approaches that are based on rigid-grid partition to develop data access structure, CNNS creates indexing structures according to data inherent distribution, with help of a progressive-styled clustering operation. The grids produced in this way adapt to data natural...
متن کاملHigh dimensional nearest neighbor searching
As databases increasingly integrate different types of information such as time-series, multimedia and scientific data, it becomes necessary to support efficient retrieval of multi-dimensional data. Both the dimensionality and the amount of data that needs to be processed are increasing rapidly. As a result of the scale and high dimensional nature, the traditional techniques have proven inadequ...
متن کاملk-Nearest neighbor searching in hybrid spaces
Little work has been reported in the literature to support k-nearest neighbor (k-NN) searches/ queries in hybrid data spaces (HDS). An HDS is composed of a combination of continuous and non-ordered discrete dimensions. This combination presents new challenges in data organization and search ordering. In this paper, we present an algorithm for k-NN searches using a stages and use the properties ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2013
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2013.0212094